A Tableau Calculus for Pronoun Resolution
نویسندگان
چکیده
Appeared in: N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX’99), Lecture Notes in Artificial Intelligence 1617, Springer, pages 247–262, 1999. We present a tableau calculus for reasoning in fragments of natural language. We focus on the problem of pronoun resolution and the way in which it complicates automated theorem proving for natural language processing. A method for explicitly manipulating contextual information during deduction is proposed, where pronouns are resolved against this context during deduction. As a result, pronoun resolution and deduction can be interleaved in such a way that pronouns are only resolved if this is licensed by a deduction rule; this helps us to avoid the combinatorial complexity of total pronoun disambiguation.
منابع مشابه
Introducing general redundancy criteria for clausal tableaux, and proposing resolution tableaux
Hyper tableau calculi are well-known as attempts to combine hyper-resolution and tableaux. Besides their soundness and completeness, it is also important to give an appropriate redundancy criterion. The task of such a criterion is to filter out “unnecessary” clauses being attached to a given tableau. This is why we investigate what redundancy criteria can be defined for clausal tableaux, in gen...
متن کاملHow to Synthesize a Tableau
We synthesize a refutationally complete tableau calculus for propositional logic by a new method, using ordered resolution as a procedural framework at the meta level. Algebraically, the calculus solves the word problem for free distributive lattices. Goal-directedness of the construction is enforced by a ne-tuned well-founded ordering on terms, atoms and clauses. The synthesis is performed in ...
متن کاملReduction rules and universal variables for first order tableaux and DPLL
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implementations such as DLP, is due to reduction rules which propagate constraints and prune the search space. Yet, for first order logic such reduction rules are only known for resolution. The lack of reduction rules for fi...
متن کاملA Resolution Calculus for Dynamic Semantics
This paper applies resolution theorem proving to natural language semantics. The aim is to circumvent the computational complexity triggered by natural language ambiguities like pronoun binding, by interleaving pronoun binding with resolution deduction. To this end, disambiguation is only applied to expressions that actually occur during derivations. Given a set of premises and a conclusion, ou...
متن کاملA Theorem Prover for Equality using Lemmas
Equality handling has been traditionally one of the weaknesses of tableau-based theorem provers in general, from which those based on the Connection Tableau Calculus are not an exception. The Intermediate Lemma Extension is based on a simple extension to Logic Programming in which positive subgoals are skipped and all clauses treated as Horn clauses, allowing to derive clauses consisting of onl...
متن کامل